Morphological Operations on Delaunay Triangulations
نویسندگان
چکیده
Algorithms are presented which allow to perform morphological transformations on unorganised sets of points represented by their Delaunay triangulation. The results show that these algorithms could behaves as morphological operators such as erosion, dilatation, opening do. As a matter of fact, they actually act as “shape filter”. These algorithms are applied to the problem of scene reconstruction by stereoscopy in which objets are represented by unstructured clouds of 3D points.
منابع مشابه
Three-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementation process for constructing 3D constrained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved...
متن کاملThe Stability of Delaunay Triangulations
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...
متن کاملA Quasi-Parallel GPU-Based Algorithm for Delaunay Edge-Flips∗
The Delaunay edge-flip algorithm is a practical method for transforming any existing triangular mesh S into a mesh T (S) that satisfies the Delaunay condition. Although several implementations of this algorithm are known, to the best of our knowledge no parallel GPU-based implementation has been reported yet. In the present work, we propose a quadriphasic and iterative GPU-based algorithm that ...
متن کاملOn the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-k Delaunay if the circumcircle of each triangle of the triangulation contains at most k points. In this paper we study lower and upper bounds on the number of higher order Delaunay trian...
متن کاملPseudo-tetrahedral complexes
A pseudo-triangulation is a cell complex in the plane whose cells are pseudo-triangles, i.e., simple polygons with exactly three convex vertices (so-called corners). Being an interesting and flexible generalization of triangulations, pseudo-triangulations have found their place in computational geometry; see e.g. [8, 11, 7, 1] and references therein. Unlike triangulations, pseudo-triangulations...
متن کامل